#include <bits/stdc++.h>

#define in read()
#define fi first
#define se second
#define pb push_back
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (y); i >= (x); i--)

using namespace std;

using pii = pair < int , int >;
using vec = vector < int >;
using veg = vector < pii >;
using ll = long long;
using db = double;

int read() {
    int x = 0; bool f = 0; char ch = getchar(); while(!isdigit(ch)) f |= ch == '-',ch = getchar();
    while(isdigit(ch)) x = x * 10 + (ch ^ 48),ch = getchar(); return f ? -x : x;
}

const int N = 2e5 + 10;

int a[N],n,k,top,stk[N],l[N],r[N];

void solve() {
	n = in,k = in; int mx = 0; rep(i, 1, n) a[i] = in,mx = max(mx,a[i]);
	ll ans = 0;
	rep(i, 1, n) {
		if(a[i] ^ mx) continue;
		if(i >= k) ans += n - i + 1;
	}
	cout << ans << endl;
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
#endif
    for(int T = in; T; T--) solve();
}
